Efficient realisation of discrete Fourier transforms using the recursive discrete Hartley transform

摘要

We present the results of our study using a recursive discrete Hartley transform technique to compute discrete Fourier transforms. We introduce an improved in-place and in-order prime-factor mapping to realise composite-length DFTs. In using these new techniques, the speed of computation is comparable to that of the Winograd Fourier transform algorithm (WFTA), whereas the program size of the present approach is smaller than that of the WFTA. This approach is suitable for cases where there are restrictions on program lengths.